Merging rule-based belief databases

نویسنده

  • R. Wehbe
چکیده

The problem of revising a belief database is treated in many classical works. We will consider here the problem of merging two belief databases (BDBs for short) Ψ1 and Ψ2, operation that will be denoted byΨ1 Ψ2, and whose result will be a new BDB. Since belief not necessarily reflects the actual state of the world (as opposed to knowledge), both BDBs could be incompatible. The goal is to construct a new BDB trying to retain as much as possible of the original beliefs of Ψ1 and Ψ2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cautious Conjunctive Merging of Belief Functions

When merging belief functions, Dempster rule of combination is justified only when information sources can be considered as independent. When this is not the case, one must find out a cautious merging rule that adds a minimal amount of information to the inputs. Such a rule is said to follow the principle of minimal commitment. Some conditions it should comply with are studied. A cautious mergi...

متن کامل

Merging Rules: Preliminary Version

In this paper we consider the merging of rules or conditionals. In contrast to other approaches, we do not invent a new approach from scratch, for one particular kind of rule, but we are interested in ways to generalize existing revision and merging operators from belief merging to rule merging. First, we study ways to merge rules based on only a notion of consistency of a set of rules, and ill...

متن کامل

Distance-Based Repairs of Databases

We introduce a general framework for repairing inconsistent databases by distance-based considerations. The uniform way of representing repairs and their semantics clarifies the essence behind various approaches to consistency restoration in database systems, helps to compare the underlying formalisms, and relates them to existing methods of defining belief revision operators, merging data sets...

متن کامل

Idempotent conjunctive combination of belief functions: Extending the minimum rule of possibility theory

When conjunctively merging two belief functions concerning a single variable but coming from different sources, Dempster rule of combination is justified only when information sources can be considered as independent. When dependencies between sources are ill-known, it is usual to require the property of idempotence for the merging of belief functions, as this property captures the possible red...

متن کامل

Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?

When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual to ask the merging operation to satisfy the property of idempotence, as this property ensures a cautious behaviour in the face of dependent sources. There are different strategies to find such rules for belief functions. One st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007